Worst-case complexity - PDFSEARCH.IO - Document Search Engine

Worst-case complexity
Results: 44

#	Item
31	Average-case complexity analysis of perfect sorting by reversals Mathilde Bouvel1 Cedric Chauve2 Dominique Rossin1 Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2009-06-24 09:20:20 Computational complexity theory Abstract algebra Permutation Best worst and average case Sorting Sorting algorithms Mathematics Combinatorics
32	Adaptive Algorithms for Problems Involving Black-Box Lipschitz Functions by Ilya Baran B.S., Massachusetts Institute of Technology (2003) Add to Reading List Source URL: www.mit.edu Language: English - Date: 2006-02-03 21:38:13 Computational complexity theory Online algorithms Algorithm Competitive analysis Best worst and average case Asymptotically optimal algorithm Approximation algorithm Theoretical computer science Applied mathematics Analysis of algorithms
33	CALL FOR PAPERS ANALYSIS OF ALGORITHMS Special Issue in Algorithmica Average-Case Analysis of Algorithms is the area of Theoretical Computer Science that studies the behavior of algorithms on random inputs. The focus is Add to Reading List Source URL: algo.inria.fr Language: English - Date: 2004-11-13 12:22:28 Computer science Mathematics Probabilistic analysis of algorithms Algorithm Randomized algorithm Best worst and average case Combinatorics Amortized analysis Analysis of algorithms Applied mathematics Probabilistic complexity theory
34	PDF Document Add to Reading List Source URL: infolab.stanford.edu Language: English - Date: 2012-07-05 15:06:24 Mathematics Computational complexity theory Time complexity Algorithm Big O notation Merge sort Sorting algorithm Best worst and average case Asymptotically optimal algorithm Theoretical computer science Analysis of algorithms Applied mathematics
35	Smoothed Analysis of Algorithms: Why the Simplex Algorithm Usually Takes Polynomial Time ∗ arXiv:cs/0111050v7 [cs.DS] 9 Oct[removed]Daniel A. Spielman † Add to Reading List Source URL: arxiv.org Language: English - Date: 2008-02-01 13:52:50 Analysis of algorithms Computational complexity theory Smoothed analysis Linear programming Simplex algorithm Algorithm Normal distribution Simplex Best worst and average case Theoretical computer science Applied mathematics Mathematics
36	Symposium on Theoretical Aspects of Computer Science[removed]Nancy, France), pp[removed]www.stacs-conf.org COLLAPSING AND SEPARATING COMPLETENESS NOTIONS UNDER AVERAGE-CASE AND WORST-CASE HYPOTHESES XIAOYANG GU 1 AND JOHN Add to Reading List Source URL: drops.dagstuhl.de Language: English - Date: 2010-03-04 08:18:12 Complexity classes NP-complete NP Reduction P/poly Advice Many-one reduction Turing reduction Polynomial-time reduction Theoretical computer science Computational complexity theory Applied mathematics
37	Adaptive Algorithms for Problems Involving Black-Box Lipschitz Functions by Ilya Baran B.S., Massachusetts Institute of Technology (2003) Add to Reading List Source URL: erikdemaine.org Language: English - Date: 2006-02-03 21:38:13 Computational complexity theory Online algorithms Algorithm Competitive analysis Best worst and average case Asymptotically optimal algorithm Approximation algorithm Theoretical computer science Applied mathematics Analysis of algorithms
38	Overcoming the Worst-Case Curse for Cryptographic Constructions Shafi Goldwasser⋆ Yael Kalai† Raluca Ada Popa⋆ Vinod Vaikuntanathan◃▹ Add to Reading List Source URL: people.csail.mit.edu Language: English Turing machine Cryptography Models of computation Homomorphic encryption Computability Alan Turing Advice PP NP Theoretical computer science Applied mathematics Computational complexity theory
39	Polynomial-Time Exact Schedulability Tests for Harmonic Real-Time Tasks Vincenzo Bonifaci∗ , Alberto Marchetti-Spaccamela† , Nicole Megow‡ , Andreas Wiese§ ∗ Istituto di Analisi dei Sistemi ed Informatica “An Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2013-10-10 18:26:14 Operations research Applied mathematics Technology Rate-monotonic scheduling Scheduling Job shop scheduling Worst-case execution time Time complexity Dynamic priority scheduling Scheduling algorithms Real-time computing Theoretical computer science
40	Remembering Why to Remember: Performance-Guided Case-Base Maintenance? David B. Leake and David C. Wilson Computer Science Department Lindley Hall 215, Indiana University Bloomington, IN 47405, U.S.A. Add to Reading List Source URL: www.cs.indiana.edu Language: English - Date: 2000-07-16 15:29:20 Mathematics Best worst and average case Computational complexity theory Algorithm Statistical hypothesis testing Statistics Applied mathematics Analysis of algorithms

UPDATE